Bidirectional Transformations with Deltas: A Dependently Typed Approach (Talk Proposal)
نویسنده
چکیده
In recent years in the bx literature, attention has turned to incor-porating intensional information about edits (based on monoid ac-tions [HPW12,AU14, for example]), or more generally, deltas (based oncategories [DXC11a, DXC11b]), describing model updates. This talksketches a dependently-typed approach to consistency maintenance,à la Meertens/Stevens [Mee98, Ste10], building on a propositions-as-types account of consistency [McK16]. The resulting definition ofdependently-typed bx (dtbx) has identities and is closed under compo-sition; examples include the above instances of delta-based bx. The def-inition is “pre-categorical”, relying on no ambient assumptions aboutcategorical structure on model spaces. We reconcile the dependently-typed approach to deltas with the categorical by examining analoguesof the hippocraticness and overwriteability properties, and discuss thisrelationship in the context of recent developments in type theory. References[AU14] D. Ahman and T. Uustalu. Coalgebraic update lenses. ENTCS, 308:25–48, 2014. [DXC11a] Z. Diskin, Y. Xiong, and K. Czarnecki. From stateto delta-based bidirectional model transforma-tions: the asymmetric case. JOT, 10:6: 1–25, 2011.[DXC11b] Z. Diskin, Y. Xiong, K. Czarnecki, H. Ehrig, F. Hermann, and F. Orejas. From stateto delta-basedbidirectional model transformations: The symmetric case. In MODELS, pages 304–318, 2011.[HPW12] M. Hofmann, B. C. Pierce, and D. Wagner. Edit lenses. In POPL, pages 495–508. ACM, 2012.[McK16] J. McKinna. Complements witness consistency. In these proceedings, 2016. [Mee98] L. Meertens. Designing constraint maintainers for user interaction. Unpublished manuscript, avail-able from http://www.kestrel.edu/home/people/meertens/, June 1998.[Ste10] Perdita Stevens. Bidirectional model transformations in QVT: Semantic issues and open questions.SoSyM, 9(1):7–20, 2010. Copyright c© by the paper’s author. Copying permitted for private and academic purposes.In: A. Anjorin, J. Gibbons (eds.): Proceedings of the Fifth International Workshop on Bidirectional Transformations (Bx 2016),Eindhoven, The Netherlands, April 8, 2016, published at http://ceur-ws.org
منابع مشابه
Dependently Typed Programming with Domain-Specific Logics (Thesis Proposal DRAFT)
We propose a thesis defending the following statement: The logical notions of polarity and focusing provide a foundation for dependently typed programming with domain-specific logics, with applications to certified software and mechanized metatheory.
متن کاملProgramming proofs: a novel approach based on contextual types
We present an overview of Beluga, a dependently-typed programming and proof development environment. Beluga uses a two-level approach: it supports specifying formal systems within the logical framework LF and on top of LF, it provides a dependently-typed functional language that supports manipulating and analyzing LF objects via pattern matching. A distinct feature of Beluga is the explicit sup...
متن کاملFunctional programming with dependently-typed higher-order data
This paper explores a new point in the design space of functional programming: functional programming with dependently typed higher-order data structures described in the logical framework LF. This allows us to program with proofs. The contributions of this paper are twofold: First, we present a syntax-directed bidirectional type system that distinguishes between dependently typed data and comp...
متن کاملA Logical Framework with Dependently Typed Records
Our long term goal is a system to formally represent complex structured mathematical objects, and proofs and computation on such objects; e.g. a foundational computer algebra system. Our approach is informed by the long development of module systems for functional programming based on dependent record types as signatures [20]. For our logical purposes, however, we want a dependently typed base ...
متن کاملAutomated Inversion of Attribute Mappings in Bidirectional Model Transformations
Bidirectional model transformations create or update a target model according to a base model and vice versa using a single transformation specification for both directions. Triple graph grammars, for example, define which model elements shall exist and how they should reference each other without repeating information for both directions. They can also copy values of simple-typed attributes, s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016